Searching for Self-Similarity in GPRS
نویسندگان
چکیده
Based on measurements in live GPRS networks, the degree of selfsimilarity for the aggregated WAP and WEB traffic is investigated by utilizing six well established Hurst parameter estimators. We show that in particular WAP traffic is long-range dependent and its scaling for time scales below the average page duration is not second order self similar. WAP over UDP can also determine the overall traffic scaling, if it is the majority traffic. Finally we observe that the minor traffic exhibits a larger Hurst value than the aggregated traffic, in case of WAP as well as in case of WEB traffic.
منابع مشابه
DETERMINING THE LEVEL OF SELF-EFFICACY IN SEARCHING FOR HEALTH INFORMATION AND ITS RELATIONSHIP WITH HEALTH INFORMATION-SEEKING BEHAVIOR OF MOTHERS OF CHILDREN UNDER TWO YEARS OLD REFERRING TO HEALTH CENTERS IN BUSHEHR
Background & Aims: Self-efficacy beliefs are one of the most important ways to achieve goals and success in various fields. One of the fields that self-efficacy has important role in it is the search for health information. This study aimed to determine the level of self-efficacy and its relationship with health information-seeking behavior of mothers of children below two years old referring t...
متن کاملTurbo similarity searching: Effect of fingerprint and dataset on virtual-screening performance
Turbo similarity searching uses information about the nearest neighbours in a conventional chemical similarity search to increase the effectiveness of virtual screening, with a data fusion approach being used to combine the nearest-neighbour information. A previous paper suggested that the approach was highly effective in operation; this paper further tests the approach using a range of differe...
متن کاملSelf-similar fractals and arithmetic dynamics
The concept of self-similarity on subsets of algebraic varieties is defined by considering algebraic endomorphisms of the variety as `similarity' maps. Self-similar fractals are subsets of algebraic varieties which can be written as a finite and disjoint union of `similar' copies. Fractals provide a framework in which, one can unite some results and conjectures in Diophantine g...
متن کاملThe Effect of Adding Indirect Relationship to Turbo Similarity Searching
Received: June 05, 2015 Revised: May 09, 2016 Accepted: May 11, 2016 Abstract: Background: Turbo Similarity Searching (TSS) has been proved as one of the effective and simple searching method in Cheminformatics. Emerging from the conventional similarity searching, TSS depended on the concept of fusion where relationship between the target being sought and the compound in the database are indire...
متن کاملAccess Structures for Advanced Similarity Search in Metric Spaces
Similarity retrieval is an important paradigm for searching in environments where exact match has little meaning. Moreover, in order to enlarge the set of data types for which the similarity search can efficiently be performed, the notion of mathematical metric space provides a useful abstraction for similarity. In this paper we consider the problem of organizing and searching large data-sets f...
متن کامل